Description: 快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm Platform: |
Size: 8083 |
Author:赵勇 |
Hits:
Description: 快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm Platform: |
Size: 1099776 |
Author:赵勇 |
Hits:
Description: Basically, this article describes one way to implement the 1D version of the FFT algorithm for an array of complex samples. The intention of this article is to show an efficient and fast FFT algorithm that can easily be modified according to the needs of the user. I ve studied the FFT algorithm when I was developing a software to make frequency analysis on a sample of captured sound.-Basically, this article describes one way to implement the 1D version of the FFT algorithm for an array of co mplex samples. The intention of this article is to show an efficient and fast FFT algorithm that can easily be modified according to the needs of the user. I ve studied the FFT algorithm when I wa s developing a software to make frequency Analytics sis on a sample of captured sound. Platform: |
Size: 27648 |
Author:冰城 |
Hits:
Description: 采用DIT和DIF两种蝶形算法实现的FFT变换，其中myfft1是DIT算法，myfft2是DIF算法，已经过测试，可以方便使用。-DIT and DIF using two algorithms of FFT butterfly transformation, which myfft1 is DIT algorithm, myfft2 is the DIF algorithm, has been tested, it will be convenient to use. Platform: |
Size: 3072 |
Author:zhanghongwei |
Hits:
Description: 自己编写的C语言基于频率抽取的基2FFT算法，用于大家学习交流-I have written C language based on the frequency of taking the base 2FFT algorithm, for them to learn from the exchange of Platform: |
Size: 1024 |
Author:王伟兰 |
Hits:
Description: FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT。按照抽取方式的不同可分为DIT-FFT（按时间抽取）和DIF-FFT（按频率抽取）算法。按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子（2n,n为大于1的整数），基2、基4算法较为常用。-FFT algorithm is the basic principle of DFT successive long sequence is broken down into shorter sequences of DFT. In accordance with the different extraction methods can be divided into the DIT-FFT (time taken) and the DIF-FFT (according to the frequency of extraction) algorithm. In accordance with the composition of different butterfly operations can be divided into base 2, base 4, base 8, as well as arbitrary factor (2n, n is an integer greater than 1), radix-2, Radix-4 algorithm is more commonly used. Platform: |
Size: 1024 |
Author:李文 |
Hits:
Description: FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT.按照抽取方式的不同可分为DIT-FFT(按时间抽取)和DIF-FFT(按频率抽取)算法.按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子(2n,n为大于1的整数),基2、基4算法较为常-The FFT algorithm s basic principle is decomposes gradually long sequence DFT into short sequence DFT. different may divide into according to the extraction way DIT-FFT (according to time extraction) and DIF-FFT (according to frequency extraction) the algorithm. Different may divide into the base 2, base 4, bases according to the butterfly-shaped operation s constitution 8 as well as the random factor (2n, n is bigger than 1 integer), the base 2, base 4 algorithms are more common. Platform: |
Size: 419840 |
Author:卡其米奇 |
Hits:
Description: 执行分裂基(split-radix)频率抽取(DIF)FFT算法,希望为同仁提供便利。-Implementation of split-based (split-radix) decimation in frequency (DIF) FFT algorithm in the hope that my colleagues facilitated. Platform: |
Size: 1024 |
Author:yuanman |
Hits:
Description: Implementing the Radix-4 Decimation
in Frequency (DIF) Fast Fourier
Transform (FFT) Algorithm Using a
TMS320C80 DSP Platform: |
Size: 150528 |
Author:seojinwon |
Hits:
Description: C语言的FFT算法，包含DIT和DIF方法，windows上测试成功-FFT algorithm C language, contains DIT and DIF windows on the test success Platform: |
Size: 5120 |
Author:zhangbin |
Hits:
Description: 1) Goertzel algorithm
2) Chirp transform algorithm
3) Verification of signal flow graphs for DIT and DIF FFT algorithm
4) Elapsed CPU time for DFT and FFT computation
5) Alternative IDFT computations Platform: |
Size: 346112 |
Author: |
Hits:
Description: 实现功能：基8实现64点FFT处理器（进行两次8点FFT计算，采用基8进行64点）
详细说明：硬件结构包括六部分，分别为输入模块、8点FFT模块、乘法模块、顺序调整模块、输出模块和总控制模块。
其中，输入模块的主要功能是将串行输入的64个数据进行分类，分成8批次，每次8个输入到8点FFT模块中进行计算。
8点FFT模块：FFT是DFT的快速算法，当点数较大时，可以较大的减少DFT的运算量。常用的FFT算法主要有两种，分别为按时间抽选的FFT算法（DIT-FFT）和按频率抽选的FFT算法（DIF-FFT）。在我们的设计中，我们采用的是按频率抽选的8点FFT算法。
乘法模块：由于旋转因子的对称性，只需要产生8个常数因子即可。但这样会复用一些单元，从而影响运算速度，为了提高计算速度，我们分析时序情况，增加了一些单元，以实现输入数据到达之后就可以进行运算。
顺序调整模块是将第一级FFT出来的数据顺序进行调整并输出到下一级FFT模块中进行计算，数据的顺序调整情况类似于输入模块，每隔8个数取一个输出。
输出模块：由于第二级FFT模块输出数据顺序不符合实际要求，因此需要调整数据的顺序，从而使64个输出数据安装顺序串行输出，结构类似于输入模块，区别只是输入变为8个数据并行，输出为一个数据串行。-Function: base 8 implement 64-point FFT processor (twice 8:00 FFT calculation, using the base 8 of 64 points)
Description: The hardware configuration consists of six parts, namely, an input module, 8-point FFT module, multiplication module, order adjustment module, the output module and total control module.
Among them, the 64 data input module is the main function of the serial input classification, divided into eight lots, each 8 inputs and 8-point FFT module calculation.
8:00 FFT module: FFT is a fast algorithm for DFT, when a large number of points, you can greatly reduce the amount of computation of the DFT. FFT algorithm commonly used mainly two were decimated by time FFT algorithm (DIT-FFT) algorithms and FFT decimation in frequency (DIF-FFT). In our design, we have adopted is based on the frequency of lottery 8:00 FFT algorithm.
Multiplication module: Since rotational symmetry factor, you only need to generate 8 constant factor. But it will reuse some of the units, which af Platform: |
Size: 32768 |
Author:李圣华 |
Hits:
Description: DIT-FFT至简设计实现法
工程说明
案例补充说明
本案例无论是模块划分、计数器设计、还是乒乓操作的读写处理，都始终基于“至简设计”的原则，用简易的代码结构就能实现复杂的DIT-FFT蝶形运算，代码设计风格极其简洁，详细可参考附录代码。(DIT-FFT to Jane design and Implementation
Engineering description
This design is based on the discussion to simple design method to achieve the 2-FFT algorithm according to the base time selection (DIF-FFT) implementation process, support N from 8 to 1024.
Case Supplement
In this case, both the module division, the counter design, and the reading and writing of table tennis operations are always based on the "to Jane" design) Platform: |
Size: 861184 |
Author:明德扬科教
|
Hits:
Description: 主要实现了输入随机点数数据的基3频域抽取FFT算法(In this paper, we mainly implement the FFT algorithm for the base 3 frequency domain of input random points data.) Platform: |
Size: 1024 |
Author:王家小丫头 |
Hits:
Search - dif fft algorithm